Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
¹®ÀÚ¿ ÁýÇÕÀÇ ¼øÀ§ÁÖ±â¿Í ¼øÀ§°æ°è º´·Ä °è»ê |
¿µ¹®Á¦¸ñ(English Title) |
Parallel Computation of Order-Preserving Periods and Order-Preserving Borders of a Set of Strings |
ÀúÀÚ(Author) |
±è¿µÈ£
½ÉÁ¤¼·
Youngho Kim
Jeong Seop Sim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 46 NO. 12 PP. 1232 ~ 1240 (2019. 12) |
Çѱ۳»¿ë (Korean Abstract) |
Á¤¼ö¾ËÆĺªÀ¸·Î ±¸¼ºµÈ °°Àº ±æÀÌÀÇ µÎ ¹®ÀÚ¿ÀÌ ÁÖ¾îÁ³À» ¶§, µÎ ¹®ÀÚ¿ÀÇ »ó´ëÀûÀÎ ¼øÀ§°¡ °°À¸¸é µÎ ¹®ÀÚ¿Àº ¼øÀ§µ¿ÇüÀ̶ó ÇÑ´Ù. ¹®ÀÚ¿ É´ (ÉîÉ´ ÉîÉè )ÀÇ Á¢µÎ»ç É´ ÉêÉÕÉôÉô Éë ÉåÉÕ ¡Â ¡Â Éæ ¿Í ¼øÀ§µ¿ÇüÀÎ ¹®ÀÚ¿ÀÌ É´ ¿¡¼ ÁÖ±âÀûÀ¸·Î ¹Ýº¹µÇ¾î ³ªÅ¸³ª¸é, É´ ÉêÉÕÉôÉô Éë ÀÇ ¼øÀ§°ü°èÇ¥ÇöÀ» É´ ÀÇ ¼øÀ§ÁÖ±â¶ó ÇÑ´Ù. ¸¸¾à É´ ÀÇ Á¢µÎ»ç É´ ÉêÉÕÉôÉôÉë ÉåÉÕ ¡Â ¡Â Éæ ¿Í Á¢¹Ì»ç É´ Éê Éç Éé ÉÕÉôÉô Éë ÀÌ ¼·Î ¼øÀ§µ¿ÇüÀ̸é, É´ ÉêÉÕÉôÉôÉë ÀÇ ¼øÀ§°ü°èÇ¥ÇöÀ» É´ ÀÇ ¼øÀ§°æ°è¶ó ÇÑ´Ù. É´ ÀÇ ¸ðµç ¼øÀ§ÁÖ±â, ¼øÀ§°æ°èÀÇ ±æÀ̴ ɺ -ÇÔ¼ö¸¦ ÀÌ¿ëÇÏ¿© °¢°¢ ɯ Éå log Éæ ½Ã°£¿¡ °è»êÇÒ ¼ö ÀÖ´Ù. º» ³í¹®¿¡¼´Â Á¤¼ö¾ËÆĺªÀ¸·Î ±¸¼ºµÈ ±æÀÌ°¡ ÀÎ ¹®ÀÚ¿µéÀÇ ÁýÇÕ þ¦É³Éè Éìɳ ÉÕÉóɳ ÉÖÉó ÉôÉôÉôÉó ɳ ÉíÀÌ ÁÖ¾îÁ³À» ¶§, þ¦ ɳ ÀÇ ¸ðµç ¼øÀ§ÁÖ±â, ¼øÀ§°æ°èÀÇ ±æÀ̸¦ °¢°¢ ɯ Éå Éæ °³ÀÇ ½º·¹µå¸¦ ÀÌ¿ëÇÏ¿© ɯ Éå Éæ ½Ã°£¿¡ °è»êÇϴ ɺ -ÇÔ¼ö ±â¹Ý º´·Ä¾Ë°í¸®ÁòÀ» Á¦½ÃÇÑ´Ù. ½ÇÇè°á°ú, =1,000, =10,000ÀÏ ¶§, ´Ù¿ìÁ¸½ºÁö¼ö µ¥ÀÌÅÍ¿¡ ´ëÇØ þ¦É³ÀÇ ¸ðµç ¼øÀ§ÁÖ±â, ¼øÀ§°æ°èÀÇ ±æÀ̸¦ °è»êÇÏ´Â º´·Ä¾Ë°í¸®ÁòÀº °¢°¢ ±âÁ¸ÀÇ ¼øÂ÷¾Ë°í¸®Áòº¸´Ù ¾à 3.47¹è, ¾à 3.41¹è ºü¸£°Ô ¼öÇàµÇ¾ú´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
Given two strings of the same length over an integer alphabet, those two strings are order-isomorphic when they have the same relative ranks. When strings order-isomorphic to É´ ÉêÉÕÉôÉô Éë ÉåÉÕ ¡Â ¡Â Éæ are periodically repeated in É´ , a representation of the order relations of É´ ÉêÉÕÉôÉô Éë is referred to as an order-preserving period of É´ . When a prefix É´ ÉêÉÕÉôÉôÉë ÉåÉÕ ¡Â ¡Â Éæ of É´ is order-isomorphic to a suffix É´ Éê Éç Éé ÉÕÉôÉô Éë of É´ , a representation of the order relations of É´ ÉêÉÕÉôÉôÉë is called an order-preserving border of É´ . The lengths of all order-preserving periods (resp. all order-preserving borders) of É´ can be computed in ɯ Éå log Éæ time using the ɺ -function. Given a set þ¦É³Éè Éìɳ ÉÕÉóɳ ÉÖÉó ÉôÉôÉôÉó ɳ Éí of strings of length over an integer alphabet, we propose parallel algorithms computing the lengths of all order-preserving periods and all order-preserving borders of þ¦É³ using ɯ Éå Éæ threads in ɯ Éå Éæ time by the ɺ -function. When compared to each sequential algorithm for Dow Jones Industrial Average, the experimental results show that our parallel algorithm for computing the lengths of all order-preserving periods (resp. all order-preserving borders) of þ¦É³ runs approximately 3.47 (resp. 3.41) times faster when =1,000, =10,000.
|
Å°¿öµå(Keyword) |
¼øÀ§ÆÐÅϸÅĪ
¼øÀ§ÁÖ±â
¼øÀ§°æ°è
º´·Ä¾Ë°í¸®Áò
GPU
order-preserving pattern matching
order-preserving periods
order-preserving borders
parallel algorithm
GPU
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|